Strong tractability of integration using scrambled Niederreiter points

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong tractability of integration using scrambled Niederreiter points

We study the randomized worst-case error and the randomized error of scrambled quasi–Monte Carlo (QMC) quadrature as proposed by Owen. The function spaces considered in this article are the weighted Hilbert spaces generated by Haar-like wavelets and the weighted Sobolev-Hilbert spaces. Conditions are found under which multivariate integration is strongly tractable in the randomized worst-case s...

متن کامل

Strong tractability of multivariate integration using quasi-Monte Carlo algorithms

We study quasi–Monte Carlo algorithms based on low discrepancy sequences for multivariate integration. We consider the problem of how the minimal number of function evaluations needed to reduce the worst-case error from its initial error by a factor of ε depends on ε−1 and the dimension s. Strong tractability means that it does not depend on s and is bounded by a polynomial in ε−1. The least po...

متن کامل

On strong tractability of weighted multivariate integration

We prove that for every dimension s and every number n of points, there exists a point-set Pn,s whose -weighted unanchored L∞ discrepancy is bounded from above by C(b)/n1/2−b independently of s provided that the sequence = {γk} has ∑∞ k=1 γ a k < ∞ for some (even arbitrarily large) a. Here b is a positive number that could be chosen arbitrarily close to zero and C(b) depends on b but not on s o...

متن کامل

Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules

In this paper we proof the existence of digitally shifted polynomial lattice rules which achieve strong tractability results for Sobolev spaces of arbitrary high smoothness. The convergence rate is shown to be best possible up to a given degree of smoothness of the integrand. Indeed we even show the existence of polynomial lattice rules which automatically adjust themselves to the smoothness of...

متن کامل

Scrambling Sobol' and Niederreiter-Xing Points

Hybrids of equidistribution and Monte Carlo methods of integration can achieve the superior accuracy of the former while allowing the simple error estimation methods of the latter. In particular randomized (0; m; s)-nets in base b produce unbiased estimates of the integral, have a variance that tends to zero faster than 1=n for any square integrable integrand, and have a variance that for nite ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2005

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-05-01755-2